Consideration of the Newly Standardized Interventional Reference Point
نویسندگان
چکیده
منابع مشابه
Motion Vector Prediction With Reference Frame Consideration
In this paper, we introduce a new motion vector prediction method that could be used within multiple picture reference codecs, such as the H.264 (MPEG-4 AVC) video coding standard. Our method considers for each candidate motion vector the temporal distance of its corresponding reference picture compared to the current one for the generation of the predictor motion vector. This allows for more a...
متن کاملEvaluation of the Effect of Tumor Position on Standardized Uptake Value Using Time-of-Flight Reconstruction and Point Spread Function
Objective(s): The present study was conducted to examine whether the standardized uptake value (SUV) may be affected by the spatial position of a lesion in the radial direction on positron emission tomography (PET) images, obtained via two methods based on time-of-flight (TOF) reconstruction and point spread function (PSF). Methods: A cylinder phantom with the sphere (30mm diameter), located in...
متن کاملFingerprint Reference Point Detection
A robust fingerprint recognition algorithm should tolerate the rotation and translation of the fingerprint image. One popular solution is to consistently detect a unique reference point and compute a unique reference orientation for translational and rotational alignment. This paper develops an effective algorithm to locate a reference point and compute the corresponding reference orientation c...
متن کاملReference Point Heterogeneity
It is well-established that, when confronted with a decision to be taken under risk, individuals use reference payoff levels as important inputs. The purpose of this paper is to study which reference points characterize decisions in a setting in which there are several plausible reference levels of payoff. We report an experiment, in which we investigate which of four potential reference points...
متن کاملReference Point Hyperplane Trees
Our context of interest is tree-structured exact search in metric spaces. We make the simple observation that, the deeper a data item is within the tree, the higher the probability of that item being excluded from a search. Assuming a fixed and independent probability p of any subtree being excluded at query time, the probability of an individual data item being accessed is (1− p) for a node at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Japanese Journal of Radiological Technology
سال: 2004
ISSN: 0369-4305,1881-4883
DOI: 10.6009/jjrt.kj00000922397